Hamiltonian cycles with all small even chords
نویسندگان
چکیده
منابع مشابه
Hamiltonian cycles with all small even chords
Let G be a graph of order n ≥ 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian cycle C = v1v2 . . . vnv1 of G with chords vivi+3 for all 1 ≤ i ≤ n (where vn+j = vj for j ≥ 1). When n is even, an ESHC contains all bipartite 2-regular graphs of order n. We prove that there is a positive integer N such that for every graph G of even order n ≥ N , if the minimum degree δ(G) ≥ n 2 +...
متن کاملSmall Cycles in Hamiltonian Graphs
We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).
متن کاملRequiring chords in cycles
R. E. Jamison proved that every cycle of length greater than three in a graph has a chord—in other words, the graph is chordal—if and only if every k-cycle is the sum of k − 2 triangles. This result generalizes to having or not having crossing chords and to having strong chords, with similar characterizations of a variety of graph classes that includes chordal bipartite, distance-hereditary, an...
متن کاملGenerating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
An efficient method to generate all edge sets X ⊆ E of a graph G = (V,E), which are vertex-disjoint unions of cycles, is presented. It can be tweaked to generate (i) all cycles, (ii) all cycles of cardinality 5, (iii) all chordless cycles, (iv) all Hamiltonian cycles. © 2007 Elsevier B.V. All rights reserved.
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.12.013